/*
 *
 * Copyright (c) 2020 The Raptor Authors. All rights reserved.
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *     http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 *
 */

#ifndef RAPTOR_LITE_UTILS_LIST_ENTRY_H_
#define RAPTOR_LITE_UTILS_LIST_ENTRY_H_

namespace raptor {

typedef struct ListEntry ListEntry;

struct ListEntry {
    ListEntry *prev;
    ListEntry *next;
};

#define RAPTOR_LIST_IS_EMPTY(head) ((head)->next == (head))

#define RAPTOR_LIST_ENTRY_INIT(entry) (entry)->prev = (entry)->next = 0

#define RAPTOR_LIST_INIT(head) (head)->prev = (head)->next = (head)

void ListPushFront(ListEntry *head, ListEntry *new_item);
void ListPushBack(ListEntry *head, ListEntry *new_item);

ListEntry *ListPopFront(ListEntry *head);
ListEntry *ListPopBack(ListEntry *head);

// Return 1 on success, 0 on failure
int ListRemoveEntry(ListEntry *item);

} // namespace raptor

#endif // RAPTOR_LITE_UTILS_LIST_ENTRY_H_
